Positivity Problems for Low-Order Linear Recurrence Sequences
نویسندگان
چکیده
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem (are all but finitely many terms of a given LRS positive?). We show decidability of both problems for LRS of order 5 or less, with complexity in the Counting Hierarchy for Positivity, and in polynomial time for Ultimate Positivity. Moreover, we show by way of hardness that extending the decidability of either problem to LRS of order 6 would entail major breakthroughs in analytic number theory, more precisely in the field of Diophantine approximation of transcendental numbers.
منابع مشابه
Effective Positivity Problems for Simple Linear Recurrence Sequences
We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive). We show that, f...
متن کاملOn the Positivity Problem for Simple Linear Recurrence Sequences,
Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9 or less, Positivity is decidable, with complexity in the Counting Hierarchy.
متن کاملNonstandard explicit third-order Runge-Kutta method with positivity property
When one solves differential equations, modeling physical phenomena, it is of great importance to take physical constraints into account. More precisely, numerical schemes have to be designed such that discrete solutions satisfy the same constraints as exact solutions. Based on general theory for positivity, with an explicit third-order Runge-Kutta method (we will refer to it as RK3 method) pos...
متن کاملPositivity of Three-Term Recurrence Sequences
In this paper, we give the sufficient conditions for the positivity of recurrence sequences defined by anun = bnun−1 − cnun−2 for n > 2, where an, bn, cn are all nonnegative and linear in n. As applications, we show the positivity of many famous combinatorial sequences.
متن کاملDecision problems on unary probabilistic and quantum automata
It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections with Skolem’s and positivity problems. We also introduce the concept of linear recurrence automata in order to show the connection naturally. Then, we also g...
متن کامل